Adaptive mesh refinement in the fast lane

Fast Volume Rendering of Sparse Datasets Using Adaptive Mesh Refinement

In this paper we present an algorithm that accelerates 3D texturebased volume rendering of large and sparse data sets. A hierarchical data structure (known as AMR tree) consisting of nested uniform grids is employed in order to efficiently encode regions of interest. The hierarchies resulting from this kind of space partitioning yield a good balance between the amount of volume to render and th...

Adaptive Mesh Refinement for Multiscale

plied and theoretical physics is to fully understand and predict the behavior of systems far from thermodynamic equilibrium,1–4 including those systems driven by an external force or experiencing a sudden change in environment (such as pressure or temperature). They also include systems transitioning from one metastable or long-lived state to another. The need to accurately model and numericall...

Efficiency considerations in triangular adaptive mesh refinement.

Locally or adaptively refined meshes have been successfully applied to simulation applications involving multi-scale phenomena in the geosciences. In particular, for situations with complex geometries or domain boundaries, meshes with triangular or tetrahedral cells demonstrate their superior ability to accurately represent relevant realistic features. On the other hand, these methods require m...

Towards adaptive mesh refinement in Nek5000

The development of adaptive mesh refinement capabilities in the field of computational fluid dynamics is an essential tool for enabling the simulation of larger and more complex physical problems. While such techniques have been known for a long time, most simulations do not make use of them because of the lack of a robust implementation. In this work, we present recent progresses that have bee...

Parallel 3D Adaptive Mesh Refinement in Titanium